powerset algebra

幂集代数

English-Chinese computer dictionary (英汉计算机词汇大词典). 2013.

Look at other dictionaries:

  • Complete Heyting algebra — In mathematics, especially in order theory, a complete Heyting algebra is a Heyting algebra which is complete as a lattice. Complete Heyting algebras are the objects of three different categories; the category CHey, the category Loc of locales,… …   Wikipedia

  • Filter (mathematics) — The powerset algebra of the set {1,2,3,4} with the upset colored green. The green elements make a principal ultrafilter on the lattice. In mathematics, a filter is a special subset of a partially ordered set. A frequently used special case is the …   Wikipedia

  • Modal μ-calculus — In theoretical computer science, the modal μ calculus (also μ calculus, but this can have a more general meaning) is an extension of propositional modal logic (with many modalities) by adding a least fixpoint operator μ and a greatest fixpoint… …   Wikipedia

  • Upper set — The powerset algebra of the set {1,2,3,4} with the upset colored green. In mathematics, an upper set (also called an upward closed set or just an upset) of a partially ordered set (X,≤) is a subset U with the property that x is in …   Wikipedia

  • Boolean prime ideal theorem — In mathematics, a prime ideal theorem guarantees the existence of certain types of subsets in a given abstract algebra. A common example is the Boolean prime ideal theorem, which states that ideals in a Boolean algebra can be extended to prime… …   Wikipedia

  • Conjunto potencia — En matemáticas, dado un conjunto S, se llama conjunto potencia o conjunto de partes de S (se denota por P(S) o 2S) al conjunto formado por todos los subconjuntos posibles de S. En la teoría de conjuntos basada en los Axiomas de Zermelo Fraenkel,… …   Wikipedia Español

  • Ultrafilter — In the mathematical field of set theory, an ultrafilter on a set X is a collection of subsets of X that is a filter, that cannot be enlarged (as a filter). An ultrafilter may be considered as a finitely additive measure. Then every subset of X is …   Wikipedia

  • Closure operator — In mathematics, a closure operator on a set S is a function cl: P(S) → P(S) from the power set of S to itself which satisfies the following conditions for all sets X,Y ⊆ S. X ⊆ cl(X) (cl is extensive) X ⊆ Y implies cl(X) ⊆ cl(Y)   (cl… …   Wikipedia

  • Complete lattice — In mathematics, a complete lattice is a partially ordered set in which all subsets have both a supremum (join) and an infimum (meet). Complete lattices appear in many applications in mathematics and computer science. Being a special instance of… …   Wikipedia

  • Completeness (order theory) — In the mathematical area of order theory, completeness properties assert the existence of certain infima or suprema of a given partially ordered set (poset). A special use of the term refers to complete partial orders or complete lattices.… …   Wikipedia

  • Power set — In mathematics, given a set S , the power set (or powerset) of S , written mathcal{P}(S), P ( S ), or 2 S , is the set of all subsets of S . In axiomatic set theory (as developed e.g. in the ZFC axioms), the existence of the power set of any set… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.